Massive Connectivity with Massive MIMO-Part II: Achievable Rate Characterization

نویسندگان

  • Liang Liu
  • Wei Yu
چکیده

This two-part paper aims to quantify the cost of device activity detection in an uplink massive connectivity scenario with a large number of devices but device activities are sporadic. Part I of this paper shows that in an asymptotic massive multiple-input multiple-output (MIMO) regime, device activity detection can always be made perfect. Part II of this paper subsequently shows that despite the perfect device activity detection, there is nevertheless significant cost due to device detection in terms of overall achievable rate, because of the fact that non-orthogonal pilot sequences have to be used in order to accommodate the large number of potential devices, resulting in significantly larger channel estimation error as compared to conventional massive MIMO systems with orthogonal pilots. Specifically, this paper characterizes each active user’s achievable rate using randommatrix theory under either maximal-ratio combining (MRC) or minimum mean-squared error (MMSE) receive beamforming at the base-station (BS), assuming the statistics of their estimated channels as derived in Part I. The characterization of user rate also allows the optimization of pilot sequences length. Moreover, in contrast to the conventional massive MIMO system, the MMSE beamforming is shown to achieve much higher rate than the MRC beamforming for the massive connectivity scenario under consideration. Finally, this paper illustrates the necessity of user scheduling for rate maximization when the number of active users is larger than the number of antennas at the BS.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Massive Connectivity with Massive MIMO-Part I: Device Activity Detection and Channel Estimation

This two-part paper considers an uplink massive device communication scenario in which a large number of devices are connected to a base-station (BS), but user traffic is sporadic so that in any given coherence interval, only a subset of users are active. The objective is to quantify the cost of active user detection and channel estimation and to characterize the overall achievable rate of a gr...

متن کامل

Sectoring in Multi-cell Massive MIMO Systems

In this paper, the downlink of a typical massive MIMO system is studied when each base station is composed of three antenna arrays with directional antenna elements serving 120◦ of the two-dimensional space. A lower bound for the achievable rate is provided. Furthermore, a power optimization problem is formulated and as a result, centralized and decentralized power allocation schemes are propos...

متن کامل

Pilot Coordination in CDI Precoded Massive MIMO Systems

Pilot contamination severely degrades the achievable rates in massive MIMO systems. To resolve the problem, many channel state information (CSI) and channel distribution information (CDI) methods were developed. This paper presents a CDI based pilot coordination method that leads to a considerable improvement in the achievable sum rate. It also shows that pilot assignment can drastically affect...

متن کامل

A Graph Theoretic Approach for Training Overhead Reduction in FDD Massive MIMO Systems

The overheads associated with feedback-based channel acquisition can greatly compromise the achievable rates of FDD based massive MIMO systems. Indeed, downlink (DL) training and uplink (UL) feedback overheads scale linearly with the number of base station (BS) antennas, in sharp contrast to TDDbased massive MIMO, where a single UL pilot trains the whole BS array. In this work, we propose a gra...

متن کامل

Semi-Blind Channel Estimation based on subspace modeling for Multi-user Massive MIMO system

‎Channel estimation is an essential task to fully exploit the advantages of the massive MIMO systems‎. ‎In this paper‎, ‎we propose a semi-blind downlink channel estimation method for massive MIMO system‎. ‎We suggest a new modeling for the channel matrix subspace. Based on the low-rankness property, we have prposed an algorithm to estimate the channel matrix subspace. In the next step, using o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1706.06433  شماره 

صفحات  -

تاریخ انتشار 2017